Enter a word or phrase in any language 👆
Language:
Translation and analysis of words by ChatGPT artificial intelligence
On this page you can get a detailed analysis of a word or phrase, produced by the best artificial intelligence technology to date:
- how the word is used
- frequency of use
- it is used more often in oral or written speech
- word translation options
- usage examples (several phrases with translation)
- etymology
ultimate output - translation to russian
A PROPERTY DESCRIBING RUN-TIME COMPLEXITY OF ALGORITHMS
Output sensitivity; Output-sensitivity
ultimate output
максимальная мощность
ultimate output
нефтегазовая промышленность
предельная добыча
полная мощность
полная производительность
ultimate
WIKIMEDIA DISAMBIGUATION PAGE
Ultimate (album); Ultimate (disambiguation); Ultimate (song)
ultimate adj. 1) самый отдаленный 2) последний, конечный; окончательный; ultimate result - окончательный результат 3) максимальный; предельный; ultimate load - предельная нагрузка; ultimate output - максимальная мощность 4) первичный, элементарный; основной; ultimate particle phys. - элементарная частица; ultimate analysis chem. - элементарный анализ Syn: see basic see final
Definition
output device
<hardware> Electronic or electromechanical equipment connected
to a computer and used to transfer data out of the computer in
the form of text, images, sounds or other media to a {display
screen}, printer, loudspeaker or storage device. Most
modern storage devices such as disk drives and {magnetic
tape drives} act as both input and output devices, others such
as CD-ROM are input only.
(1997-03-18)
Wikipedia
Output-sensitive algorithm
In computer science, an output-sensitive algorithm is an algorithm whose running time depends on the size of the output, instead of, or in addition to, the size of the input. For certain problems where the output size varies widely, for example from linear in the size of the input to quadratic in the size of the input, analyses that take the output size explicitly into account can produce better runtime bounds that differentiate algorithms that would otherwise have identical asymptotic complexity.
